467A - George and Accommodation - CodeForces Solution

implementation *800

Please click on ads to support us..

Python Code: 

t=int(input())
c=0
while(t>0):
    p,q=map(int,input().split())
    if(q-p>=2):
        c+=1
    t-=1
print(c)

C++ Code: 

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main(){
long long n;
cin>>n;
long long x,y;
long long cnt=0;
for(int i=0;i<n;i++){
    cin>>x>>y;
    if(y-x>=2){
        cnt++;
    }
}
cout<<cnt<<endl;

return 0;
}


Comments

Submit
0 Comments
More Questions

202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards
897A - Scarborough Fair
1433B - Yet Another Bookshelf
1283B - Candies Division
1451B - Non-Substring Subsequence
1408B - Arrays Sum
1430A - Number of Apartments